package minPathSum64;

public class MinPathSum {
    public int minPathSum(int[][] grid) {
        int m = grid.length;//行
        int n = grid[0].length;//列
        int[][] dp = new int[m][n];
        dp[0][0] = grid[0][0];
        //填充第一行
        for (int i = 1; i < m; i++) {
            dp[0][i] = dp[0][i - 1] + grid[0][i];
        }
        //填充第一列
        for (int i = 1; i < n; i++) {
            dp[i][0] = dp[i-1][0] + grid[i][0];
        }
        //填充其它
        for (int i = 1; i < m ; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1])+grid[i][j];
            }
        }
        return dp[m - 1][n - 1];
    }

    public static void main(String[] args) {
        MinPathSum minPathSum = new MinPathSum();
        int[][] a = {{1,3,1},{1,5,1},{4,2,1}};
        System.out.println(minPathSum.minPathSum(a));
    }


}
